A discrete time queueing system with departures having random memory
نویسندگان
چکیده
منابع مشابه
T-S FUZZY MODEL-BASED MEMORY CONTROL FOR DISCRETE-TIME SYSTEM WITH RANDOM INPUT DELAY
A memory control for T-S fuzzy discrete-time systems with sto- chastic input delay is proposed in this paper. Dierent from the common assumptions on the time delay in the existing literatures, it is assumed in this paper that the delays vary randomly and satisfy some probabilistic dis- tribution. A new state space model of the discrete-time T-S fuzzy system is derived by introducing some stocha...
متن کاملDiscrete Time Analysis of Multi-Server Queueing System with Multiple Working Vacations and Reneging of Customers
This paper analyzes a discrete-time $Geo/Geo/c$ queueing system with multiple working vacations and reneging in which customers arrive according to a geometric process. As soon as the system gets empty, the servers go to a working vacations all together. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. Customer...
متن کاملt-s fuzzy model-based memory control for discrete-time system with random input delay
a memory control for t-s fuzzy discrete-time systems with sto- chastic input delay is proposed in this paper. dierent from the common assumptions on the time delay in the existing literatures, it is assumed in this paper that the delays vary randomly and satisfy some probabilistic dis- tribution. a new state space model of the discrete-time t-s fuzzy system is derived by introducing some stocha...
متن کاملAnalysis of a Discrete-Time Queueing System with Timed Vacations
We consider a discrete-time GI-G-1 queueing system with server vacations. Vacations occur whenever the queue becomes empty or whenever a timer expires. When the timer expires one of the following four actions are considered: the server completes transmission of the present packet before leaving for a vacation, the service immediately leaves for a vacation and the interrupted packet’s service is...
متن کاملA Discrete-Time Retrial Queueing System With Service Upgrade
This paper considers a discrete-time retrial queueing system with displacements. The arriving customers can opt to go directly to the server obtaining immediately its service or to join the orbit. In the first case, the displaced customer goes directly to the orbit. The arrivals follow a geometrical law and the service times are general. We study the Markov chain underlying the considered queue...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Operations Research
سال: 1979
ISSN: 0399-0559,1290-3868
DOI: 10.1051/ro/1979130201851